Two-node fluid network with a heavy-tailed random input: the strong stability case

نویسندگان

  • Sergey Foss
  • Masakiyo Miyazawa
چکیده

We consider a two-node fluid network with batch arrivals of random size having a heavy-tailed distribution. We are interested in the tail asymptotics for the stationary distribution of a two-dimensional queue-length process. The tail asymptotics have been well studied for two-dimensional reflecting processes where jumps have either a bounded or an unbounded light-tailed distribution. However, presence of heavy tails totally changes the asymptotics. Here we focus on the case of strong stability where both nodes release fluid with sufficiently high speeds to minimise their mutual influence. We show that, like in the one-dimensional case, big jumps provide the main cause for queues to become large, but now they may have multidimensional features. We first find the weak tail asymptotics for a directional marginal of the stationary distribution in an arbitrary direction under Poisson arrival instants. In this case, decomposition formulas for the stationary distribution play a key role. Then we employ the sample-path arguments to find the exact tail asymptotics for the directional marginal under renewal arrival instants assuming one-dimensional batch arrivals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IMPROVING CONFIDENCE IN NETWORK SIMULATIONS Michele

Simulationhas become the tool of choice for an increasing number of networking researchers. Unfortunately, standard statistical techniques often cannot be applied when Internet-like heavy-tailed workloads are used as input. We present issues involved in using heavy-tailed distributions in network simulations, including three different methods for dealing with such distributions in simulation. W...

متن کامل

Adaptive Neural Network Method for Consensus Tracking of High-Order Mimo Nonlinear Multi-Agent Systems

This paper is concerned with the consensus tracking problem of high order MIMO nonlinear multi-agent systems. The agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. The communication network topology of agents is assumed to be a fixed undirected graph. A distributed adaptive control method is proposed to solve the consensus problem utilizing re...

متن کامل

Performance of a Leaky Bucket System with Long-Range Dependent Input Traffic

The study of traffic on data networks has changed substantially since the appearance of modern communication systems, which are essentially different from the traditional voice traffic networks. The main difference that appears in modern networks is the dependence structure of the data. While traditional models are based on assumptions of short range dependence, recent measurements (see [Leland...

متن کامل

Learning Bayesian Network Structure using Markov Blanket in K2 Algorithm

‎A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG)‎. ‎There are basically two methods used for learning Bayesian network‎: ‎parameter-learning and structure-learning‎. ‎One of the most effective structure-learning methods is K2 algorithm‎. ‎Because the performance of the K2 algorithm depends on node...

متن کامل

Random Walks with Lookahead on Power Law Random Graphs

We show that in power law random graphs, a.s., the expected rate at which a random walk with lookahead discovers the nodes of the graph is sublinear. Searching a graph by simulating a random walk is a natural way to abstract Web crawling [5]. Recently, the random walk simulation method has been also proposed to search P2P networks [11], [4], [10]. Therefore, it is important to characterize the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Probability

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2014